-
1 comparability theorem
Большой англо-русский и русско-английский словарь > comparability theorem
-
2 comparability theorem
Математика: теорема о сравнимости -
3 comparability theorem
English-Russian scientific dictionary > comparability theorem
-
4 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
5 теорема о сравнимости
Большой англо-русский и русско-английский словарь > теорема о сравнимости
-
6 similarity
1. n сходство; подобиеto bear certain similarity — быть несколько похожим, немного напоминать
2. n мат. подобиеСинонимический ряд:1. agreement (noun) agreement; approximation; closeness; comparability; kinship2. harmony (noun) coincidence; concordance; concurrence; conformance; conformity; harmony; homogeneity; homology3. likeness (noun) affinity; alikeness; analogy; correspondence; likeness; mimesis; mimicry; parallelism; resemblance; semblance; similitude4. relationship (noun) community; comparison; correlation; interrelation; parity; reciprocity; relation; relationship; simileАнтонимический ряд:
См. также в других словарях:
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
Cox's theorem — Cox s theorem, named after the physicist Richard Threlkeld Cox, is a derivation of the laws of probability theory from a certain set of postulates. This derivation justifies the so called logical interpretation of probability. As the laws of… … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
Social choice theory — is a theoretical framework for measuring individual interests, values, or welfares as an aggregate towards collective decision. A non theoretical example of a collective decision is passing a set of laws under a constitution. Social choice theory … Wikipedia
Split graph — In graph theory, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs were first studied by Földes and Hammer in two papers in 1977, and independently introduced by Tyshkevich and… … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
Dedekind–MacNeille completion — The Hasse diagram of a partially ordered set (left) and its Dedekind–MacNeille completion (right). In order theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal… … Wikipedia
Order dimension — A partial order of dimension 4 (shown as a Hasse diagram) and four total orderings that form a realizer for this partial order. In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the… … Wikipedia
Perfect graph — The Paley graph of order 9, colored with three colors and showing a clique of three vertices. In this graph and each of its induced subgraphs the chromatic number equals the clique number, so it is a perfect graph. In graph theory, a perfect… … Wikipedia
PECOTA — PECOTA, an acronym for Player Empirical Comparison and Optimization Test Algorithm, is a sabermetric system for forecasting Major League Baseball player performance. The word is a backronym based on the name of journeyman major league player Bill … Wikipedia